Amplification, Redundancy, and Quantum Chernoff Information

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amplification, redundancy, and quantum Chernoff information.

Amplification was regarded, since the early days of quantum theory, as a mysterious ingredient that endows quantum microstates with macroscopic consequences, key to the "collapse of the wave packet," and a way to avoid embarrassing problems exemplified by Schrödinger's cat. Such a bridge between the quantum microworld and the classical world of our experience was postulated ad hoc in the Copenh...

متن کامل

Lecture 2 The Chernoff bound and median-of-means amplification

In the previous lecture we introduced a streaming algorithm for estimating the frequency moment F2. The algorithm used very little space, logarithmic in the length of the stream, provided we could store a random function h : {1, . . . , n} → {±1} “for free” in memory. In general this would require n bits of memory, one for each value of the function. However, observe that our analysis used the ...

متن کامل

Chernoff information of exponential families

Chernoff information upper bounds the probability of error of the optimal Bayesian decision rule for 2-class classification problems. However, it turns out that in practice the Chernoff bound is hard to calculate or even approximate. In statistics, many usual distributions, such as Gaussians, Poissons or frequency histograms called multinomials, can be handled in the unified framework of expone...

متن کامل

Distinguishing Distributions Using Chernoff Information

In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempts or samples required to distinguish two distributions efficiently in various protocols. This includes weakly verifiable puzzles such as CAPTCHA-like challenge-response protocols, interactive arguments in sequential composition...

متن کامل

Chernoff Information between Gaussian Trees

In this paper, we aim to provide a systematic study of the relationship be-tween Chernoff information and topological, as well as algebraic propertiesof the corresponding Gaussian tree graphs for the underlying graphical test-ing problems. We first show the relationship between Chernoff informationand generalized eigenvalues of the associated covariance matrices. It is then<...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2014

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.112.140406